Using NSGAII to Solve Bi-objective Bed Allocation Problems
نویسندگان
چکیده
منابع مشابه
A New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملExtending ACOR to Solve Multi-Objective Problems
Ant Colony Optimization (ACO) was first proposed to solve the Traveling Salesman Problem, and later applied to solve more problems of a combinatorial nature. Some research based on ACO to tackle continuous problems has been published, but this has not followed the original ACO metaheuristic exactly. Recently, ACOR has been proposed to solve continuous function optimization problems. We have tak...
متن کاملExpanding ACOR to solve multi-objective problems
Recently ACO R has been proposed to solve continuous function optimization problems. We have taken this work and expanded it to solve multi-objective optimization problems. After a brief analysis of the results obtained and have compared them with other two well-know methods, we state that solutions from ACO R are promising.
متن کاملParallel partitioning method (PPM): A new exact method to solve bi-objective problems
Parallel partitioning method (PPM): A new exact method to solve bi-objective problems. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplin...
متن کاملa new approach to solve multiple objective programming problems
multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of University of Human Development
سال: 2015
ISSN: 2411-7765,2411-7757
DOI: 10.21928/juhd.v1n3y2015.pp397-401